Balance-theoretic models and incomplete signed digraphs
نویسنده
چکیده
Ž . The initial structural models based on balance theory structural balance and clusterability dealt with Ž . incomplete signed digraphs. However, newer models ranked clusters, transitivity, hierarchical M-cliques apply only to zero-one matrices representing either unsigned digraphs or complete signed digraphs. Since empirical networks of affective relations are signed but seldom complete — actors may have neutral feelings towards alters or affections may be unknown to the researcher — the latter models must be redefined if affective relations are to be analysed. It was found that each balance-theoretic model is characterised by a particular type of semicycle or path. Counts of the types of semicycles and paths suffice to identify the models. This approach is more general than triadic analysis because it handles complete as well as incomplete signed digraphs. q 1999 Elsevier Science B.V. All rights reserved. Ž . Classification code: Social network analysis 0665 ; Methodology and research technology; Research methŽ . odsrtools 0104
منابع مشابه
Twin signed total Roman domatic numbers in digraphs
Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...
متن کاملA State Transition Matrix-Based Approach to Separation of Cooperations and Antagonisms in Opinion Dynamics
This paper is concerned with the dynamics evolution of opinions in the presence of both cooperations and antagonisms. The class of Laplacian flows is addressed through signed digraphs subject to switching topologies. Further, a state transition matrix-based approach is developed for the analysis of opinion dynamics, regardless of any assumptions on connectivity, structural balance or digon sign...
متن کاملOn the Energy of Bicyclic Signed Digraphs
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...
متن کاملComputing the Line Index of Balance Using Integer Programming Optimisation
An important measure of a signed graph is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line inde...
متن کاملOn signed digraphs with all cycles negative
It is known that signed graphs with all cycles negative are those in which each block is a negative cycle or a single line. We now study the more difficult problem for signed digraphs. In particular we investigate the structure of those digraphs whose arcs can be signed (positive or negative) so that every (directed) cycle is negative. Such digraphs are important because they are associated wit...
متن کامل